Clones containing all almost unary functions
نویسنده
چکیده
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the clone lattice. This is especially interesting if X is countably infinite, in which case it is known that such a simple description cannot be obtained for the second maximal clone over the unary functions.
منابع مشابه
The Number of Unary Clones Containing the Permutations on an Infinite Set
We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, sometimes as large as the whole clone lattice. 1. Background and the result Fix a set X and consider for all n ≥ 1 the set O(n) of n-ary operations on X. If we take the union O = ⋃ n≥1 O (n) over these sets, we...
متن کاملMaximal Clones on Uncountable Sets That Include All Permutations
We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We th...
متن کاملLog-supermodular functions, functional clones and counting CSPs
Motivated by a desire to understand the computational complexity of counting constraint satisfaction problems (counting CSPs), particularly the complexity of approximation, we study functional clones of functions on the Boolean domain, which are analogous to the familiar relational clones constituting Post’s lattice. One of these clones is the collection of log-supermodular (lsm) functions, whi...
متن کاملClones on Regular Cardinals
We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a stron...
متن کاملUnary polynomials in algebras, I
The unary algebraic functions of an algebra already determine the congruences. Therefore , investigations of algebras with some prescribed propert ies of congruences can be divided into two major steps. First, one characterizes the monoid of unary algebraic functions of the algebra. Secondly, one tries to build up the algebra, knowing its unary algebraic functions. Of course we may only aim at ...
متن کامل